A–maze–ing Esterel

The foundations of Esterel

Compiling Esterel

A-maze-ing Esterel

This paper shows that the kernel fragment of Esterel corresponding to combinational circuits admits a natural game–theoretic interpretation. Technically, combinational Esterel programs are mapped into finite two–player games in such a way that the standard must– and cannot–analysis of signal statuses is reflected in the computation of winning strategies. The novel game–theoretic approach comple...

Delays in Esterel

The timing details in many embedded applications are inseparable from other behavioural aspects. Time is also a resource; a physical constraint on system design that introduces limitations and costs. Design and implementation choices are often explored and decided simultaneously, complicating both tasks and encouraging platform specific programs where the meaning of a specification is mixed wit...

Instantaneous Transitions in Esterel

Esterel is an imperative synchronous programming language for the specification of deterministic concurrent reactive systems. While providing the usual control-flow constructs—sequences, loops, conditionals, and exceptions—its lack of a goto instruction makes the programming of arbitrary finite state machines awkward and hinders the design of source-to-source program transformations. We previou...